0.00/0.11	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.12/0.12	% Command    : run_E %s %d THM
0.13/0.33	% Computer : n023.cluster.edu
0.13/0.33	% Model    : x86_64 x86_64
0.13/0.33	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.33	% Memory   : 8042.1875MB
0.13/0.33	% OS       : Linux 3.10.0-693.el7.x86_64
0.13/0.33	% CPULimit   : 960
0.13/0.33	% WCLimit    : 120
0.13/0.33	% DateTime   : Tue Aug  9 05:59:57 EDT 2022
0.20/0.34	% CPUTime    : 
0.20/0.46	Running higher-order on 8 cores theorem proving
0.20/0.46	Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=120 /export/starexec/sandbox/benchmark/theBenchmark.p
0.20/0.46	# Version: 3.0pre003-ho
0.20/0.47	# Preprocessing class: HSSSSMSSSSSNSSN.
0.20/0.47	# Scheduled 4 strats onto 8 cores with 120 seconds (960 total)
0.20/0.47	# Starting ehoh_best_nonlift_nonlambdatoforall with 600s (5) cores
0.20/0.47	# Starting post_as_ho10 with 120s (1) cores
0.20/0.47	# Starting new_bool_9 with 120s (1) cores
0.20/0.47	# Starting sh5l with 120s (1) cores
0.20/0.47	# ehoh_best_nonlift_nonlambdatoforall with pid 29284 completed with status 0
0.20/0.47	# Result found by ehoh_best_nonlift_nonlambdatoforall
0.20/0.47	# Preprocessing class: HSSSSMSSSSSNSSN.
0.20/0.47	# Scheduled 4 strats onto 8 cores with 120 seconds (960 total)
0.20/0.47	# Starting ehoh_best_nonlift_nonlambdatoforall with 600s (5) cores
0.20/0.47	# No SInE strategy applied
0.20/0.47	# Search class: HUUPF-FFSF00-DSSFFFNN
0.20/0.47	# partial match(1): HUUPF-FFSF00-SSSFFFNN
0.20/0.47	# Scheduled 6 strats onto 5 cores with 600 seconds (600 total)
0.20/0.47	# Starting new_ho_10 with 325s (1) cores
0.20/0.47	# Starting ehoh_best_nonlift_nonlambdatoforall with 61s (1) cores
0.20/0.47	# Starting new_bool_1 with 55s (1) cores
0.20/0.47	# Starting new_bool_2 with 55s (1) cores
0.20/0.47	# Starting new_bool_9 with 55s (1) cores
0.20/0.47	# new_ho_10 with pid 29290 completed with status 9
0.20/0.47	# Starting sh5l with 49s (1) cores
0.20/0.47	# ehoh_best_nonlift_nonlambdatoforall with pid 29291 completed with status 0
0.20/0.47	# Result found by ehoh_best_nonlift_nonlambdatoforall
0.20/0.47	# Preprocessing class: HSSSSMSSSSSNSSN.
0.20/0.47	# Scheduled 4 strats onto 8 cores with 120 seconds (960 total)
0.20/0.47	# Starting ehoh_best_nonlift_nonlambdatoforall with 600s (5) cores
0.20/0.47	# No SInE strategy applied
0.20/0.47	# Search class: HUUPF-FFSF00-DSSFFFNN
0.20/0.47	# partial match(1): HUUPF-FFSF00-SSSFFFNN
0.20/0.47	# Scheduled 6 strats onto 5 cores with 600 seconds (600 total)
0.20/0.47	# Starting new_ho_10 with 325s (1) cores
0.20/0.47	# Starting ehoh_best_nonlift_nonlambdatoforall with 61s (1) cores
0.20/0.47	# Preprocessing time       : 0.001 s
0.20/0.47	# Presaturation interreduction done
0.20/0.47	
0.20/0.47	# Proof found!
0.20/0.47	# SZS status Theorem
0.20/0.47	# SZS output start CNFRefutation
0.20/0.47	thf(decl_22, type, esk1_0: $i).
0.20/0.47	thf(decl_23, type, esk2_0: $i).
0.20/0.47	thf(decl_24, type, epred1_0: $i > $i > $o).
0.20/0.47	thf(decl_25, type, esk3_1: ($i > $i > $o) > $i).
0.20/0.47	thf(decl_26, type, esk4_0: $i).
0.20/0.47	thf(cTHM47C_pme, conjecture, ((^[X1:$i, X2:$i]:(((X1)=(X2))))=(^[X3:$i, X4:$i]:(![X5:$i > $i > $o]:((![X6:$i]:((X5 @ X6 @ X6))=>(X5 @ X3 @ X4)))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', cTHM47C_pme)).
0.20/0.47	thf(c_0_1, negated_conjecture, (($eq)!=(^[Z0:$i, Z1:$i]:(![X5:$i > $i > $o]:((![X6:$i]:((X5 @ X6 @ X6))=>(X5 @ Z0 @ Z1)))))), inference(fof_simplification,[status(thm)],[inference(fool_unroll,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cTHM47C_pme])])])])).
0.20/0.47	thf(c_0_2, negated_conjecture, (($eq)!=(^[Z0:$i, Z1:$i]:(![X13:$i > $i > $o]:((![X14:$i]:((X13 @ X14 @ X14))=>(X13 @ Z0 @ Z1)))))), inference(split_conjunct,[status(thm)],[c_0_1])).
0.20/0.47	thf(c_0_3, negated_conjecture, (![X15:$i > $i > $o]:((![X16:$i]:((X15 @ X16 @ X16))=>(X15 @ esk1_0 @ esk2_0)))<~>((esk1_0)=(esk2_0))), inference(neg_ext,[status(thm)],[c_0_2])).
0.20/0.47	thf(c_0_4, negated_conjecture, ![X5:$i > $i > $o]:((((esk1_0)=(esk2_0))|(X5 @ esk1_0 @ esk2_0)|~((X5 @ (esk3_1 @ X5) @ (esk3_1 @ X5))))), inference(dynamic cnf,[status(thm)],[c_0_3])).
0.20/0.47	thf(c_0_5, negated_conjecture, (((esk1_0)!=(esk2_0))|~((epred1_0 @ esk1_0 @ esk2_0))), inference(dynamic cnf,[status(thm)],[c_0_3])).
0.20/0.47	thf(c_0_6, negated_conjecture, ((esk1_0)=(esk2_0)), inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[inference(cn,[status(thm)],[])]), c_0_4])).
0.20/0.47	thf(c_0_7, negated_conjecture, ![X1:$i]:(((epred1_0 @ X1 @ X1)|((esk1_0)!=(esk2_0)))), inference(dynamic cnf,[status(thm)],[c_0_3])).
0.20/0.47	thf(c_0_8, negated_conjecture, ~((epred1_0 @ esk2_0 @ esk2_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_5, c_0_6]), c_0_6])])).
0.20/0.47	thf(c_0_9, negated_conjecture, ![X1:$i]:((epred1_0 @ X1 @ X1)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_7, c_0_6])])).
0.20/0.47	thf(c_0_10, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_8, c_0_9])]), ['proof']).
0.20/0.47	# SZS output end CNFRefutation
0.20/0.47	# Parsed axioms                        : 1
0.20/0.47	# Removed by relevancy pruning/SinE    : 0
0.20/0.47	# Initial clauses                      : 1
0.20/0.47	# Removed in clause preprocessing      : 0
0.20/0.47	# Initial clauses in saturation        : 1
0.20/0.47	# Processed clauses                    : 11
0.20/0.47	# ...of these trivial                  : 1
0.20/0.47	# ...subsumed                          : 0
0.20/0.47	# ...remaining for further processing  : 10
0.20/0.47	# Other redundant clauses eliminated   : 0
0.20/0.47	# Clauses deleted for lack of memory   : 0
0.20/0.47	# Backward-subsumed                    : 0
0.20/0.47	# Backward-rewritten                   : 5
0.20/0.47	# Generated clauses                    : 15
0.20/0.47	# ...of the previous two non-redundant : 13
0.20/0.47	# ...aggressively subsumed             : 0
0.20/0.47	# Contextual simplify-reflections      : 0
0.20/0.47	# Paramodulations                      : 1
0.20/0.47	# Factorizations                       : 0
0.20/0.47	# NegExts                              : 3
0.20/0.47	# Equation resolutions                 : 0
0.20/0.47	# Propositional unsat checks           : 0
0.20/0.47	#    Propositional check models        : 0
0.20/0.47	#    Propositional check unsatisfiable : 0
0.20/0.47	#    Propositional clauses             : 0
0.20/0.47	#    Propositional clauses after purity: 0
0.20/0.47	#    Propositional unsat core size     : 0
0.20/0.47	#    Propositional preprocessing time  : 0.000
0.20/0.47	#    Propositional encoding time       : 0.000
0.20/0.47	#    Propositional solver time         : 0.000
0.20/0.47	#    Success case prop preproc time    : 0.000
0.20/0.47	#    Success case prop encoding time   : 0.000
0.20/0.47	#    Success case prop solver time     : 0.000
0.20/0.47	# Current number of processed clauses  : 3
0.20/0.47	#    Positive orientable unit clauses  : 2
0.20/0.47	#    Positive unorientable unit clauses: 0
0.20/0.47	#    Negative unit clauses             : 1
0.20/0.47	#    Non-unit-clauses                  : 0
0.20/0.47	# Current number of unprocessed clauses: 4
0.20/0.47	# ...number of literals in the above   : 6
0.20/0.47	# Current number of archived formulas  : 0
0.20/0.47	# Current number of archived clauses   : 7
0.20/0.47	# Clause-clause subsumption calls (NU) : 0
0.20/0.47	# Rec. Clause-clause subsumption calls : 0
0.20/0.47	# Non-unit clause-clause subsumptions  : 0
0.20/0.47	# Unit Clause-clause subsumption calls : 2
0.20/0.47	# Rewrite failures with RHS unbound    : 0
0.20/0.47	# BW rewrite match attempts            : 2
0.20/0.47	# BW rewrite match successes           : 2
0.20/0.47	# Condensation attempts                : 0
0.20/0.47	# Condensation successes               : 0
0.20/0.47	# Termbank termtop insertions          : 552
0.20/0.47	
0.20/0.47	# -------------------------------------------------
0.20/0.47	# User time                : 0.004 s
0.20/0.47	# System time              : 0.005 s
0.20/0.47	# Total time               : 0.009 s
0.20/0.47	# Maximum resident set size: 1704 pages
0.20/0.47	
0.20/0.47	# -------------------------------------------------
0.20/0.47	# User time                : 0.012 s
0.20/0.47	# System time              : 0.008 s
0.20/0.47	# Total time               : 0.020 s
0.20/0.47	# Maximum resident set size: 1712 pages
0.20/0.47	EOF